Section: Research Program

Answer Set Programing (ASP)

The DREAM team is investigating declarative approaches to solve complex problems such as causal reasoning, landscape simultation and pattern mining. One such approach is ASP.

ASP (Answer set programming) [60] , [47] is a programming paradigm enabling declarative problem solving. It combines a rich yet simple modelling language with high-performance solving capacities, tailored to Knowledge Representation and Reasoning. "Declarative problem solving" means that the program is close to the way a problem is enunciated, and not to the way the problem is solved. This facilitates writing and revising programs. ASP is an outgrowth of research on the use of non monotonic reasoning in knowledge representation. ASP programs [67] consist in rules that look like Prolog rules, but the computational mechanism is different [69] .

ASP allows to solve search problems in NP (and theoretically in NP${}^{NP}$) in a uniform way (being more compact than boolean approaches like SAT solvers). ASP is good when dealing with knowledge representation, particularly when logical rules or graphs are involved. The versatility of ASP is reflected by the ASP solver clasp, winning first places at ASP, SAT and other competitions.

The main interests of using ASP are: 1) the ease to write and to update programs, and 2) the efficiency of the ASP solvers (improved in the recent versions).

Our main challenge is to propose ASP modeling that scales up to solving real problems. We are especially working on the modeling of sequential pattern mining with ASP in order to mine real datasets in a flexible and efficient way.

Our second challenge is to model a wide range of expert knowledge to include reasoning into the solving processes, in order to output more meaningful results.